Dual Regularized Unsupervised Feature Selection Based on Matrix Factorization and Minimum Redundancy with application in gene selection
نویسندگان
چکیده
Gene expression data have become increasingly important in machine learning and computational biology over the past few years. In field of gene analysis, several matrix factorization-based dimensionality reduction methods been developed. However, such can still be improved terms efficiency reliability. this paper, an innovative approach to feature selection, called Dual Regularized Unsupervised Feature Selection Based on Matrix Factorization Minimum Redundancy (DR-FS-MFMR), is introduced. The major focus DR-FS-MFMR discard redundant features from set original features. order reach target, primary selection problem defined two aspects: (1) factorization weight representation matrix, (2) correlation information related selected set. Then, objective function enriched by employing characteristics along with inner product regularization criterion perform both redundancy minimization process sparsity task more precisely. To demonstrate proficiency method, a large number experimental studies are conducted nine datasets. obtained results indicate productivity for task.
منابع مشابه
Efficient Spectral Feature Selection with Minimum Redundancy
Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and unsupervised feature selection, and has been proven to be effective in many real-world applications. One common drawback associated with most existing spectral feature selection algorithms is that they evaluate features i...
متن کاملMinimum Redundancy Feature Selection for Microarray Gene Expression Data
Selecting a small subset of genes out of the thousands of genes in microarray data is important for accurate classification of phenotypes. Widely used methods typically rank genes according to their differential expressions among phenotypes and pick the top-ranked genes. We observe that feature sets so obtained have certain redundancy and study methods to minimize it. Feature sets obtained thro...
متن کاملMinimum Redundancy Feature Selection from Microarray Gene Expression Data
How to selecting a small subset out of the thousands of genes in microarray data is important for accurate classification of phenotypes. Widely used methods typically rank genes according to their differential expressions among phenotypes and pick the top-ranked genes. We observe that feature sets so obtained have certain redundancy and study methods to minimize it. We propose a minimum redunda...
متن کاملFast-Ensembles of Minimum Redundancy Feature Selection
Finding relevant subspaces in very highdimensional data is a challenging task not only for microarray data. The selection of features must be stable, but on the other hand learning performance is to be increased. Ensemble methods have succeeded in the increase of stability and classification accuracy, but their runtime prevents them from scaling up to real-world applications. We propose two met...
متن کاملSelf-representation based dual-graph regularized feature selection clustering
Feature selection algorithms eliminate irrelevant and redundant features, even the noise, while preserving the most representative features. They can reduce the dimension of the dataset, extract essential features in high dimensional data and improve learning quality. Existing feature selection algorithms are all carried out in data space. However, the information of feature space cannot be ful...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge Based Systems
سال: 2022
ISSN: ['1872-7409', '0950-7051']
DOI: https://doi.org/10.1016/j.knosys.2022.109884